//
// Created by xili on 2024/8/13 19:17.
// GO BIG OR GO HOME.
//
#include "leetcode.h"

class Solution {
public:
    bool isArraySpecial(vector<int> &nums) {
        int n = nums.size();
        for (int i = 1; i < nums.size(); i++) {
            if ((nums[i] & 1) == (nums[i - 1] & 1)) {
                return false;
            }
        }
        return true;
    }
};